-
1 vertex connectedness number
Математика: число вершинной связности (графа)Универсальный англо-русский словарь > vertex connectedness number
-
2 vertex connectedness number
English-Russian scientific dictionary > vertex connectedness number
-
3 connectedness
связность, логичность, связанность -
4 number
1) число || числовой2) номер || нумеровать3) код числа4) количество5) колонцифра6) численность || считать, подсчитывать, исчислять8) числительное•a great number of — множество, большое количество
a number of — (целый) ряд, некоторое количество
- absolutely pseudoprime number - connectivity number - deficient number - edge attachment number - edge covering number - edge sensitivity number - expected sample number - general recursively irrational number - geodesic crossing number - integer number - integral number - internal stability number - international customer number - mass exchange number - mixed-radix number - Mohs hardness number - number of principal cotype - number of space dimensions - octonary number - one-digit number - one-figure number - one's complement number - rectilinear crossing number - recursively real number - serial number - Shore hardness number - strictly positive number - vertex covering numberwinding number of a curve with respect to the point — порядок кривой относительно точки (число оборотов вектора, соединяющего данную точку с точкой кривой при обходе кривой)
-
5 число вершинной связности
Mathematics: vertex connectedness number (графа)Универсальный русско-английский словарь > число вершинной связности
-
6 число вершинной связности
( графа) vertex connectedness numberРусско-английский научно-технический словарь Масловского > число вершинной связности
См. также в других словарях:
Connectedness — This article is about mathematics. For other uses, see Connectedness (disambiguation). In mathematics, connectedness is used to refer to various properties meaning, in some sense, all one piece . When a mathematical object has such a property, we … Wikipedia
Dominator (graph theory) — For Dominating set problem, see Dominating set. In computer science, in control flow graphs, a node d dominates a node n if every path from the start node to n must go through d. Notationally, this is written as d dom n (or sometimes d n). By… … Wikipedia
Solid modeling — The geometry in solid modeling is fully described in 3‑D space; objects can be viewed from any angle. Modeled and ray traced in Cobalt Solid modeling (or modelling) is a consistent set of principles for mathematical and computer modeling of three … Wikipedia
Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… … Wikipedia
Scale-free network — A scale free network is a network whose degree distribution follows a power law, at least asymptotically. That is, the fraction P ( k ) of nodes in the network having k connections to other nodes goes for large values of k as P ( k ) k − γ where… … Wikipedia
List of theorems — This is a list of theorems, by Wikipedia page. See also *list of fundamental theorems *list of lemmas *list of conjectures *list of inequalities *list of mathematical proofs *list of misnamed theorems *Existence theorem *Classification of finite… … Wikipedia
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Graph homomorphism — Not to be confused with graph homeomorphism. In the mathematical field of graph theory a graph homomorphism is a mapping between two graphs that respects their structure. More concretely it maps adjacent vertices to adjacent vertices. Contents 1… … Wikipedia
List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… … Wikipedia
List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… … Wikipedia
Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… … Wikipedia